A cartesian closed category in Martin-Löf's intuitionistic type theory
نویسندگان
چکیده
منابع مشابه
A cartesian closed category in Martin-Löf's intuitionistic type theory
First, we briefly recall the main definitions of the theory of Information Bases and Translations. These mathematical structures are the basis to construct the cartesian closed category InfBas, which is equivalent to the category ScDom of Scott Domains. Then, we will show that all the definitions and the proof of all the properties that one needs in order to show that InfBas is indeed a cartesi...
متن کاملThe Interpretation of Intuitionistic Type Theory in Locally Cartesian Closed Categories - an Intuitionistic Perspective
We give an intuitionistic view of Seely’s interpretation of Martin-Löf’s intuitionistic type theory in locally cartesian closed categories. The idea is to use Martin-Löf type theory itself as metalanguage, and E-categories, the appropriate notion of categories when working in this metalanguage. As an E-categorical substitute for the formal system of Martin-Löf type theory we use E-categories wi...
متن کاملLocally cartesian closed categories and type theory
0. Introduction. I t is well known that for much of the mathematics of topos theory, it is in fact sufficient to use a category C whose slice categories C/A are cartesian closed. In such a category, the notion of a 'generalized set', for example an 'Aindexed set', is represented by a morphism B^-A of C, i.e. by an object of C/A. The point about such a category C is that C is a C-indexed categor...
متن کاملCATEGORY THEORY as an extension of Martin - Lflf Type Theory
Category theory has tong been widely recognised as being conveniently formalisable In constructive mathematics. We describe a computer implementation of its basic concepts, as an extension of the Goteborg implementation of Martin-Lofs theory of types; we discuss some alternative formulations of the theory (and our reasons for rejecting them) and briefly comment on the problems of automating the...
متن کاملAnother introduction to Martin-Löf’s Intuitionistic Type Theory
ion Γ, x :j N ⊢ K :i L Γ ⊢ ((x :j N)K) :i ((x :j N)L) application Γ ⊢ N :i ((x :j L)M) Γ ⊢ K :j L Γ ⊢ N(K) :i M [x := K] These rules by themselves are almost useless since no expression can be assigned a type because to prove the conclusion of a rule one should have already proved the premise(s). So in order to start we need some axiom. The first thing one has to do is to settle the maximum lev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00309-7